Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases
نویسندگان
چکیده
منابع مشابه
Some fixed-parameter tractable classes of Dual and related problems⋆
In this paper we present fixed-parameter algorithms for the problem Dual—given two hypergraphs, decide if one is the transversal hypergraph of the other—and related problems. In the first part, we give algorithms for the parameters number of edges of the hypergraphs, the maximum degree of a vertex, and vertex complementary degrees. In the second part, we use an Apriori approach to obtain FPT re...
متن کاملApproximation and fixed-parameter algorithms for consecutive ones submatrix problems
We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This characterization finds applications in new polynomial-time approximation algorithms and fixed-parameter tractability results for the NP-hard problem to delete a minimum number of rows or columns from a 0/1-matrix such that the remaining s...
متن کاملTowards Fixed-Parameter Tractable Algorithms for Argumentation
Abstract argumentation frameworks have received a lot of interest in recent years. Most computational problems in this area are intractable but several tractable fragments have been identified. In particular, Dunne showed that many problems can be solved in linear time for argumentation frameworks of bounded tree-width. However, these tractability results, which were obtained via Courcelle’s Th...
متن کاملFixed Parameter Tractable Algorithms in Combinatorial Topology
To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an exponential-time enumeration. However, asymptotically most graphs do not result in any 3-manifold triangulation, which leads to significant “wasted time” in top...
متن کاملFixed-parameter algorithms for some combinatorial problems in bioinformatics
NP-hard problems occur often in bioinformatics. The typical huge sizes of biological problem instances often prohibit solving NP-hard problems in bioinformatics optimally with classical approaches. Fixed-parameterized algorithmics has been developed in 1990s as a new approach to solve NP-hard problem optimally in a guaranteed running time. The essential idea of fixed-parameter algorithms is to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2018
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-018-0405-x